On predictive probability matching priors

نویسنده

  • Trevor Sweeting
چکیده

We revisit the question of priors that achieve approximate matching of Bayesian and frequentist predictive probabilities. Such priors may be thought of as providing frequentist calibration of Bayesian prediction or simply as devices for producing frequentist prediction regions. Here we analyse the O(n) term in the expansion of the coverage probability of a Bayesian prediction region, as derived in [4]. Unlike the situation for parametric matching, asymptotic predictive matching priors may depend on the level α. We investigate uniformly predictive matching priors (UPMPs); that is, priors for which this O(n) term is zero for all α. It was shown in [4] that, in the case of quantile matching and a scalar parameter, if such a prior exists then it must be Jeffreys’ prior. In the present article we investigate UPMPs in the multiparameter case and present some general results about the form, and uniqueness or otherwise, of UPMPs for both quantile and highest predictive density matching.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probability Matching Priors

A probability matching prior is a prior distribution under which the posterior probabilities of certain regions coincide with their coverage probabilities, either exactly or approximately. Use of such a prior will ensure exact or approximate frequentist validity of Bayesian credible regions. Probability matching priors have been of interest for many years but there has been a resurgence of inte...

متن کامل

On a Property of Probability Matching Priors: Matching the Alternative Coverage Probabilities

In frequentist inference based on conndence sets, both the true coverage and the probability for a conndence set to include an alternative value of the parameter of interest are important. Thus if probability matching priors also match such alternative coverage probabilities there is perhaps a stronger justiication for calling them noninformative. Considering contiguous alternatives, we obtain ...

متن کامل

On the uniqueness of probability matching priors

Probability matching priors are priors for which Bayesian and frequentist inference, in the form of posterior quantiles, or confidence intervals, agree to some order of approximation. These priors are constructed by solving a first order partial differential equation, that may be difficult to solve. However, Peers (1965) and Tibshirani (1989) showed that under parameter orthogonality a family o...

متن کامل

On the implementation of local probability matching priors for interest parameters

Probability matching priors are priors for which the posterior probabilities of certain specified sets are exactly or approximately equal to their coverage probabilities. These priors arise as solutions of partial differential equations that may be difficult to solve, either analytically or numerically. Recently Levine & Casella (2003) presented an algorithm for the implementation of probabilit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007